Secure Internet Voting on Limited Devices with Anonymized DSA Public Keys

نویسندگان

  • Rolf Haenni
  • Oliver Spycher
چکیده

This paper presents an Internet voting protocol, which is primarily designed for limited voting devices such as smart cards or mobile phones. The minimum requirement for these devices is the ability to compute one ElGamal encryption and one DSA signature in reasonable time. The protocol is based on an anonymization mechanism for DSA public keys, which can be installed on top of an existing DSA public-key infrastructure for each individual voting event. The protocol protects the privacy of the voters and offers public verifiability, but it is not receipt-free or coercion-resistant. As a counter-measure against vote buying or coercion attacks, it can be used as the electronic component of a hybrid voting system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Virtual Private Networks powered by Elliptic Curve Cryptography

Elliptic Curve Cryptography (ECC) is fast becoming a viable alternative to traditional public-key cryptosystems (RSA, DSA, DH). Although ECC algorithms have been available for quite some time, most of the work in this field has been theoretical in nature, with few actual implementations. This situation has changed because of two factors. One is that processing power itself is increasing and hac...

متن کامل

Mining Your Ps and Qs: Detection of Widespread Weak Keys in Network Devices

RSA and DSA can fail catastrophically when used with malfunctioning random number generators, but the extent to which these problems arise in practice has never been comprehensively studied at Internet scale. We perform the largest ever network survey of TLS and SSH servers and present evidence that vulnerable keys are surprisingly widespread. We find that 0.75% of TLS certificates share keys d...

متن کامل

D4.1 - Security definitions and attacker models for e-voting protocols

In 2010 Hao, Ryan and Zielinski proposed a simple decentralized e-voting protocol that only requires 2 rounds of communication. Thus, for k elections their protocol needs 2k rounds of communication. Observing that the first round of their protocol is aimed to establish the public-keys of the voters, we propose an extension of the protocol as a non-interactive e-voting scheme in the public-key s...

متن کامل

Convertible limited (multi-) verifier signature: new constructions and applications

A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...

متن کامل

Key management systems for sensor networks in the context of the Internet of Things

If a Wireless Sensor Network (WSN) is to be completely integrated into the Internet as part of the Internet of Things (IoT), it is necessary to consider various security challenges, such as the creation of a secure channel between an Internet host and a sensor node. In order to create such channel, it is necessary to provide key management mechanisms that allow two remote devices to negotiate c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011